Complexity of independent set reconfigurability problems
نویسندگان
چکیده
We study problems of reconfigurability of independent sets in graphs. We consider three different models (token jumping, token sliding, and token addition and removal) and analyze relationships between them. We prove that independent set reconfigurability in perfect graphs (under any of the three models) generalizes the shortest path reconfigurability problem in general graphs and is therefore PSPACE-complete. On the positive side, we give polynomial results for even-hole-free graphs and P4-free graphs.
منابع مشابه
Shortest Reconfiguration of Sliding Tokens on a Caterpillar
Suppose that we are given two independent sets Ib and Ir of a graph such that |Ib| = |Ir|, and imagine that a token is placed on each vertex in Ib. Then, the sliding token problem is to determine whether there exists a sequence of independent sets which transforms Ib into Ir so that each independent set in the sequence results from the previous one by sliding exactly one token along an edge in ...
متن کاملSweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملGoing beyond the Hero in Leadership Development: The Place of Healthcare Context, Complexity and Relationships; Comment on “Leadership and Leadership Development in Healthcare Settings – A Simplistic Solution to Complex Problems?”
There remains a conviction that the torrent of publications and the financial outlay on leadership development will create managers with the skills and characters of perfect leaders, capable of guiding healthcare organisations through the challenges and crises of the 21st century. The focus of much attention continues to be the search for the (illusory) core set of heroic qualities, abilities o...
متن کاملQuantum Complexity Bounds for Independent Set Problems
We present quantum complexity lower and upper bounds for independent set problems in graphs. In particular, we give quantum algorithms for computing a maximal and a maximum independent set in a graph. We present applications of these algorithms for some graph problems. Our results improve the best classical complexity bounds for the corresponding problems.
متن کاملReconfigurability and Reliability of Systolic/Wavefront Arrays
AbstructIn this paper, we study fault-tolerant redundant structures for maintaining reliable arrays. In particular, we assume the desired array (application graph) is embedded in a certain class of regular, bounded-degree graphs called dynamic graphs. We define the degree of reconfigurability D R , and D R with distance D R d , of a redundant graph. When D R (respectively, D R d ) is independen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 439 شماره
صفحات -
تاریخ انتشار 2012